Modeling of Gauss Elimination Technique and AHA Simplex Algorithm for Multi-objective Linear Programming Problems

Modified Gauss Elimination Technique for Separable Nonlinear Programming Problem

Gauss elimination algorithm for interval matrix

Dual Face Algorithm Using Gauss-jordan Elimination for Linear Programming

The dual face algorithm uses Cholesky factorization, as would be not very suitable for sparse computations. The purpose of this paper is to present a dual face algorithm using Gauss-Jordan elimination for solving bounded-variable LP problems.

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

modified gauss elimination technique for separable nonlinear programming problem